An average-case analysis for a continuous random search algorithm
نویسندگان
چکیده
منابع مشابه
Average Case Behavior of Random Search for theMaximumJames
This paper is a study of the error in approximating the global maximum of a Brownian motion on the unit interval by observing the value at randomly chosen points. One point of view is to look at the error from random sampling for a given xed Brownian sample path; another is to look at the error with both the path and observations random. In the rst case we show that for almost all Brownian path...
متن کاملAn Average-case Analysis of the Gaussian Algorithm for Lattice Reduction an Average-case Analysis of the Gaussian Algorithm for Lattice Reduction an Average-case Analysis of the Gaussian Algorithm for Lattice Reduction
The Gaussian algorithm for lattice reduction in dimension 2 is analysed under its standard version. It is found that, when applied to random inputs in a continuous model, the complexity is constant on average, the probability distribution decays geometrically, and the dynamics is characterized by a conditional invariant measure. The proofs make use of connections between lattice reduction, cont...
متن کاملThe Lattice Reduction Algorithm of Gauss: An Average Case Analysis
The lattice reduction algorithm of Gauss is shown to have an average case complexity which is asymptotic to a constant. Introduction. The “reduction” algorithm of Gauss plays an important r6le in several areas of computational number theory, principally in matters related to the reduction of integer lattice bases. It is also intimately connected with extensions to complex numbers of the Euclide...
متن کاملAnalysis of an Exhaustive Search Algorithm in Random Graphs
Abstract. We analyze the cost used by a naive exhaustive search algorithm for finding a maximum independent set in random graphs under the usual Gn;p-model where each possible edge appears independently with the same probability p. The expected cost turns out to be of the less common asymptotic order n log , which we explore from several different perspectives. Also we collect many instances wh...
متن کاملPSEUDO-RANDOM DIRECTIONAL SEARCH: A NEW HEURISTIC FOR OPTIMIZATION
Meta-heuristics have already received considerable attention in various fields of engineering optimization problems. Each of them employes some key features best suited for a specific class of problems due to its type of search space and constraints. The present work develops a Pseudo-random Directional Search, PDS, for adaptive combination of such heuristic operators. It utilizes a short term...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Applied Probability
سال: 1985
ISSN: 0001-8678,1475-6064
DOI: 10.1017/s0001867800014750